Determine Mesh Size through Monomer Mean-Square Displacement
نویسندگان
چکیده
منابع مشابه
Kernel least mean square with adaptive kernel size
Kernel adaptive filters (KAF) are a class of powerful nonlinear filters developed in Reproducing Kernel Hilbert Space (RKHS). The Gaussian kernel is usually the default kernel in KAF algorithms, but selecting the proper kernel size (bandwidth) is still an open important issue especially for learning with small sample sizes. In previous research, the kernel size was set manually or estimated in ...
متن کاملMean square convergence analysis for kernel least mean square algorithm
In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...
متن کاملMonomer-dimer tatami tilings of square regions
We prove that the number of monomer-dimer tilings of an n × n square grid, with m < n monomers in which no four tiles meet at any point is m2 + (m + 1)2, when m and n have the same parity. In addition, we present a new proof of the result that there are n2 such tilings with n monomers, which divides the tilings into n classes of size 2. The sum of these tilings over all monomer counts has the c...
متن کاملMean Square Estimation
The problem of parameter estimation in linear model is pervasive in signal processing and communication applications. It is often common to restrict attention to linear estimators, which simplifies the implementation as well as the mathematical derivations. The simplest design scenario is when the second order statistics of the parameters to be estimated are known and it is desirable to minimiz...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polymers
سال: 2019
ISSN: 2073-4360
DOI: 10.3390/polym11091405